Approximate closest community search in networks
نویسندگان
چکیده
منابع مشابه
Approximate Closest Community Search in Networks
Recently, there has been significant interest in the study of the community search problem in social and information networks: given one or more query nodes, find densely connected communities containing the query nodes. However, most existing studies do not address the “free rider” issue, that is, nodes far away from query nodes and irrelevant to them are included in the detected community. So...
متن کاملCommunication-Efficient Search for an Approximate Closest Lattice Point
We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost and (ii) obtain the error probability. The approximate closest lattice point considered here is the one obtained using the nearest-plane (Babai) algorithm. ...
متن کاملClosest point search in lattices
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closest point search algorithm, based on the Schnorr–Euchner variation of the Pohst method, is implemented. Given an arbitrary point...
متن کاملClosest Point Search in High Dimensions
The problem of nding the closest point in high-dimensional spaces is common in computational vision. Unfortunately, the complexity of most existing search algorithms , such as k-d tree and R-tree, grows exponentially with dimension, making them impractical for di-mensionality above 15. In nearly all applications, the closest point is of interest only if it lies within a user speciied distance. ...
متن کاملInfluential Community Search in Large Networks
Community search is a problem of finding densely connected subgraphs that satisfy the query conditions in a network, which has attracted much attention in recent years. However, all the previous studies on community search do not consider the influence of a community. In this paper, we introduce a novel community model called k-influential community based on the concept of k-core, which can cap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2015
ISSN: 2150-8097
DOI: 10.14778/2856318.2856323